Dynamical dessins are dense

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical Dessins Are Dense

We apply a recent result of the first author to prove the following result: any continuum in the plane can be approximated arbitrarily closely in the Hausdorff topology by the Julia set of a critically finite polynomial with two finite postcritical points.

متن کامل

Dynamical Interactions in Dense Stellar Clusters

This chapter reviews the dynamical processes that occur in young stellar clusters. The formation of a stellar cluster is a complex process whereby hundreds to thousands of stars form near-simultaneously in a bound configuration. We discuss the dynamical processes involved in the formation and early evolution of a stellar cluster. Young clusters are known to contain significant amounts of mass i...

متن کامل

Dynamical fluctuations in dense granular flows.

We have made measurements of force and velocity fluctuations in a variety of dense, gravity-driven granular flows under flow conditions close to the threshold of jamming. The measurements reveal a microscopic state that evolves rapidly from entirely collisional to largely frictional, as the system is taken close to jamming. On coarse-grained time scales, some descriptors of the dynamics-such as...

متن کامل

Plane Sextics via Dessins D’enfants

We develop a geometric approach to the study of plane sextics with a triple singular point. As an application, we give an explicit geometric description of all irreducible maximal sextics with a type E7 singular point and compute their fundamental groups. All groups found are finite; one of them is nonabelian.

متن کامل

Dense graphs are antimagic

An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1, . . . ,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. A conjecture of Ringel (see [4]) states that every connected graph, but K2,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revista Matemática Iberoamericana

سال: 2015

ISSN: 0213-2230

DOI: 10.4171/rmi/862